Computationally Efficient Image Mosaicing Using Spanning Tree Representations

نویسندگان

  • Nikos Nikolaidis
  • Ioannis Pitas
چکیده

Optimal image mosaicing has large computational complexity, that becomes prohibitive as the number of sub-images increases. Two methods are proposed, which require less computation time by performing mosaicing in pairs of two sub-images at a time, without significant reconstruction losses, as evidenced by simulation results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problem

The representation of candidate solutions and the variation operators are fundamental design choices in an evolutionary algorithm (EA). This paper proposes a novel representation technique and suitable variation operators for the degree-constrained minimum spanning tree problem. For a weighted, undirected graph G(V, E), this problem seeks to identify the shortest spanning tree whose node degree...

متن کامل

Online Learning of Approximate Dependency Parsing Algorithms

In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow dependency structures with multiple parents per word. We show that those extensions can make the MST framework computationally intractable, but that the intractability can be circumvented with new approximate parsing algori...

متن کامل

A Minimum Spanning Tree Framework for Inferring Phylogenies

A Minimum Spanning Tree Framework for Inferring Phylogenies by Daniel Giannico Adkins Doctor of Philosophy in Computer Science University of California, Berkeley Professor Satish B. Rao, Chair This dissertation discusses how to write efficient, deterministic programs to infer phylogenetic trees. These programs are based on a theoretically optimal polynomial time algorithm. The programs are prac...

متن کامل

An Underwater Image Mosaicing and Fusion Approach based on Weighted Aggregation Energy Threshold using Multi-wavelet Transform

As ideal tools, autonomous underwater vehicles (AUVs) are used to implement underwater monitoring missions instead of human. Because the underwater images captured are many close-range images, the mosaicing and fusion method is applicable to create large visual representations of the sea floor. A novel mosaicing and fusion approach based on weighted aggregation energy threshold using Biorthogon...

متن کامل

Learning Tree-structured Descriptor Quantizers for Image Categorization

Current state-of-the-art image categorization systems rely on bag-of-words representations that model image content as a histogram of quantization indices that code local image appearance. In this context, randomized tree-structured quantizers have been shown to be both computationally efficient and yielding discriminative visual words for a given categorization task. This paper presents a new ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005